38 #include "oops/arrayKlass.inline.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, Klass* k, Symbol* name, TRAPS) {
50 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
51 "array klasses must be same size as InstanceKlass");
52
53 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
54
55 return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name);
56 }
57
58 Klass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_data,
59 int n, Klass* element_klass, TRAPS) {
60
61 // Eagerly allocate the direct array supertype.
62 Klass* super_klass = NULL;
63 if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {
64 Klass* element_super = element_klass->super();
65 if (element_super != NULL) {
66 // The element type has a direct super. E.g., String[] has direct super of Object[].
67 super_klass = element_super->array_klass_or_null();
68 bool supers_exist = super_klass != NULL;
69 // Also, see if the element has secondary supertypes.
70 // We need an array type for each.
71 const Array<Klass*>* element_supers = element_klass->secondary_supers();
72 for( int i = element_supers->length()-1; i >= 0; i-- ) {
73 Klass* elem_super = element_supers->at(i);
74 if (elem_super->array_klass_or_null() == NULL) {
75 supers_exist = false;
76 break;
77 }
78 }
79 if (!supers_exist) {
80 // Oops. Not allocated yet. Back out, allocate it, and retry.
81 Klass* ek = NULL;
82 {
83 MutexUnlocker mu(MultiArray_lock);
84 super_klass = element_super->array_klass(CHECK_0);
85 for( int i = element_supers->length()-1; i >= 0; i-- ) {
86 Klass* elem_super = element_supers->at(i);
87 elem_super->array_klass(CHECK_0);
88 }
89 // Now retry from the beginning
90 ek = element_klass->array_klass(n, CHECK_0);
91 } // re-lock
92 return ek;
93 }
94 } else {
95 // The element type is already Object. Object[] has direct super of Object.
96 super_klass = SystemDictionary::Object_klass();
97 }
98 }
99
100 // Create type name for klass.
101 Symbol* name = ArrayKlass::create_element_klass_array_name(element_klass, CHECK_NULL);
102
103 // Initialize instance variables
104 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_0);
105
106 // Add all classes to our internal class loader list here,
107 // including classes in the bootstrap (NULL) class loader.
108 // GC walks these as strong roots.
109 loader_data->add_class(oak);
110
111 ModuleEntry* module = oak->module();
112 assert(module != NULL, "No module entry for array");
113
114 // Call complete_create_array_klass after all instance variables has been initialized.
115 ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_0);
116
117 return oak;
118 }
119
120 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, ID) {
121 this->set_dimension(n);
122 this->set_element_klass(element_klass);
123 // decrement refcount because object arrays are not explicitly freed. The
134 bk = element_klass;
135 }
136 assert(bk != NULL && (bk->is_instance_klass()
137 || bk->is_typeArray_klass()), "invalid bottom klass");
138 this->set_bottom_klass(bk);
139 this->set_class_loader_data(bk->class_loader_data());
140
141 this->set_layout_helper(array_layout_helper(T_OBJECT));
142 assert(this->is_array_klass(), "sanity");
143 assert(this->is_objArray_klass(), "sanity");
144 }
145
146 int ObjArrayKlass::oop_size(oop obj) const {
147 assert(obj->is_objArray(), "must be object array");
148 return objArrayOop(obj)->object_size();
149 }
150
151 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
152 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_0);
153 int size = objArrayOopDesc::object_size(length);
154 return (objArrayOop)Universe::heap()->array_allocate(this, size, length,
155 /* do_zero */ true, THREAD);
156 }
157
158 static int multi_alloc_counter = 0;
159
160 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
161 int length = *sizes;
162 if (rank == 1) { // last dim may be valueArray
163 return oopFactory::new_array(element_klass(), length, CHECK_NULL);
164 }
165 guarantee(rank > 1, "Rank below 1");
166 // Call to lower_dimension uses this pointer, so most be called before a
167 // possible GC
168 Klass* ld_klass = lower_dimension();
169 // If length < 0 allocate will throw an exception.
170 objArrayOop array = allocate(length, CHECK_NULL);
171 objArrayHandle h_array (THREAD, array);
172 if (length != 0) {
173 for (int index = 0; index < length; index++) {
174 ArrayKlass* ak = ArrayKlass::cast(ld_klass);
175 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
176 h_array->obj_at_put(index, sub_array);
177 }
178 } else {
179 // Since this array dimension has zero length, nothing will be
180 // allocated, however the lower dimension values must be checked
181 // for illegal values.
182 for (int i = 0; i < rank - 1; ++i) {
183 sizes += 1;
184 if (*sizes < 0) {
185 THROW_MSG_0(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
186 }
187 }
188 }
189 return h_array();
190 }
191
192 // Either oop or narrowOop depending on UseCompressedOops.
193 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
194 arrayOop d, size_t dst_offset, int length, TRAPS) {
195 if (oopDesc::equals(s, d)) {
196 // since source and destination are equal we do not need conversion checks.
197 assert(length > 0, "sanity check");
198 ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
199 } else {
200 // We have to make sure all elements conform to the destination array
201 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
202 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
203 if (stype == bound || stype->is_subtype_of(bound)) {
204 // elements are guaranteed to be subtypes, so no check necessary
205 ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);
206 } else {
207 // slow case: need individual subtype checks
208 // note: don't use obj_at_put below because it includes a redundant store check
209 if (!ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length)) {
210 ResourceMark rm(THREAD);
211 stringStream ss;
309 } else if (UseCompressedOops) {
310 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(src_pos);
311 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(dst_pos);
312 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(s, src_offset, NULL) ==
313 objArrayOop(s)->obj_at_addr_raw<narrowOop>(src_pos), "sanity");
314 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(d, dst_offset, NULL) ==
315 objArrayOop(d)->obj_at_addr_raw<narrowOop>(dst_pos), "sanity");
316 do_copy(s, src_offset, d, dst_offset, length, CHECK);
317 } else {
318 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(src_pos);
319 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(dst_pos);
320 assert(arrayOopDesc::obj_offset_to_raw<oop>(s, src_offset, NULL) ==
321 objArrayOop(s)->obj_at_addr_raw<oop>(src_pos), "sanity");
322 assert(arrayOopDesc::obj_offset_to_raw<oop>(d, dst_offset, NULL) ==
323 objArrayOop(d)->obj_at_addr_raw<oop>(dst_pos), "sanity");
324 do_copy(s, src_offset, d, dst_offset, length, CHECK);
325 }
326 }
327
328
329 Klass* ObjArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) {
330
331 assert(dimension() <= n, "check order of chain");
332 int dim = dimension();
333 if (dim == n) return this;
334
335 // lock-free read needs acquire semantics
336 if (higher_dimension_acquire() == NULL) {
337 if (or_null) return NULL;
338
339 ResourceMark rm;
340 JavaThread *jt = (JavaThread *)THREAD;
341 {
342 // Ensure atomic creation of higher dimensions
343 MutexLocker mu(MultiArray_lock, THREAD);
344
345 // Check if another thread beat us
346 if (higher_dimension() == NULL) {
347
348 // Create multi-dim klass object and link them together
349 Klass* k =
350 ObjArrayKlass::allocate_objArray_klass(class_loader_data(), dim + 1, this, CHECK_NULL);
351 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
352 ak->set_lower_dimension(this);
353 // use 'release' to pair with lock-free load
354 release_set_higher_dimension(ak);
355 assert(ak->is_objArray_klass(), "incorrect initialization of ObjArrayKlass");
356 }
357 }
358 } else {
359 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
360 }
361
362 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
363 if (or_null) {
364 return ak->array_klass_or_null(n);
365 }
366 return ak->array_klass(n, THREAD);
367 }
368
369 Klass* ObjArrayKlass::array_klass_impl(bool or_null, TRAPS) {
370 return array_klass_impl(or_null, dimension() + 1, THREAD);
371 }
372
373 bool ObjArrayKlass::can_be_primary_super_slow() const {
374 if (!bottom_klass()->can_be_primary_super())
375 // array of interfaces
376 return false;
377 else
378 return Klass::can_be_primary_super_slow();
379 }
380
381 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots,
382 Array<InstanceKlass*>* transitive_interfaces) {
383 assert(transitive_interfaces == NULL, "sanity");
384 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
385 const Array<Klass*>* elem_supers = element_klass()->secondary_supers();
386 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();
387 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
388 if (num_secondaries == 2) {
389 // Must share this for correct bootstrapping!
390 set_secondary_supers(Universe::the_array_interfaces_array());
391 return NULL;
392 } else {
393 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
394 secondaries->push(SystemDictionary::Cloneable_klass());
395 secondaries->push(SystemDictionary::Serializable_klass());
396 for (int i = 0; i < num_elem_supers; i++) {
397 Klass* elem_super = elem_supers->at(i);
398 Klass* array_super = elem_super->array_klass_or_null();
399 assert(array_super != NULL, "must already have been created");
400 secondaries->push(array_super);
401 }
402 return secondaries;
403 }
404 }
405
406 void ObjArrayKlass::initialize(TRAPS) {
407 bottom_klass()->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
408 }
409
410 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
411 ArrayKlass::metaspace_pointers_do(it);
412 it->push(&_element_klass);
413 it->push(&_bottom_klass);
414 }
415
416 // JVM support
417
418 jint ObjArrayKlass::compute_modifier_flags(TRAPS) const {
|
38 #include "oops/arrayKlass.inline.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, Klass* k, Symbol* name, TRAPS) {
50 assert(ObjArrayKlass::header_size() <= InstanceKlass::header_size(),
51 "array klasses must be same size as InstanceKlass");
52
53 int size = ArrayKlass::static_size(ObjArrayKlass::header_size());
54
55 return new (loader_data, size, THREAD) ObjArrayKlass(n, k, name);
56 }
57
58 Klass* ObjArrayKlass::allocate_objArray_klass(ArrayStorageProperties storage_props,
59 int n, Klass* element_klass, TRAPS) {
60 // Eagerly allocate the direct array supertype.
61 Klass* super_klass = NULL;
62 if (!Universe::is_bootstrapping() || SystemDictionary::Object_klass_loaded()) {
63 Klass* element_super = element_klass->super();
64 if (element_super != NULL) {
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(storage_props);
67 bool supers_exist = super_klass != NULL;
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(ArrayStorageProperties::empty) == NULL) {
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 = NULL;
81 {
82 MutexUnlocker mu(MultiArray_lock);
83 super_klass = element_super->array_klass(CHECK_0);
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_0);
87 }
88 // Now retry from the beginning
89 ek = element_klass->array_klass(storage_props, n, CHECK_0);
90 } // re-lock
91 return ek;
92 }
93 } else {
94 // The element type is already Object. Object[] has direct super of Object.
95 super_klass = SystemDictionary::Object_klass();
96 }
97 }
98
99 // Create type name for klass.
100 Symbol* name = ArrayKlass::create_element_klass_array_name(storage_props.is_null_free(), element_klass, CHECK_NULL);
101
102 // Initialize instance variables
103 ClassLoaderData* loader_data = element_klass->class_loader_data();
104 ObjArrayKlass* oak = ObjArrayKlass::allocate(loader_data, n, element_klass, name, CHECK_0);
105
106 // Add all classes to our internal class loader list here,
107 // including classes in the bootstrap (NULL) class loader.
108 // GC walks these as strong roots.
109 loader_data->add_class(oak);
110
111 ModuleEntry* module = oak->module();
112 assert(module != NULL, "No module entry for array");
113
114 // Call complete_create_array_klass after all instance variables has been initialized.
115 ArrayKlass::complete_create_array_klass(oak, super_klass, module, CHECK_0);
116
117 return oak;
118 }
119
120 ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, ID) {
121 this->set_dimension(n);
122 this->set_element_klass(element_klass);
123 // decrement refcount because object arrays are not explicitly freed. The
134 bk = element_klass;
135 }
136 assert(bk != NULL && (bk->is_instance_klass()
137 || bk->is_typeArray_klass()), "invalid bottom klass");
138 this->set_bottom_klass(bk);
139 this->set_class_loader_data(bk->class_loader_data());
140
141 this->set_layout_helper(array_layout_helper(T_OBJECT));
142 assert(this->is_array_klass(), "sanity");
143 assert(this->is_objArray_klass(), "sanity");
144 }
145
146 int ObjArrayKlass::oop_size(oop obj) const {
147 assert(obj->is_objArray(), "must be object array");
148 return objArrayOop(obj)->object_size();
149 }
150
151 objArrayOop ObjArrayKlass::allocate(int length, TRAPS) {
152 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_0);
153 int size = objArrayOopDesc::object_size(length);
154 bool populate_null_free = storage_properties().is_null_free() && (dimension() == 1);
155 objArrayOop array = (objArrayOop)Universe::heap()->array_allocate(this, size, length,
156 /* do_zero */ true, THREAD);
157 if (populate_null_free) {
158 assert(!element_klass()->is_array_klass(), "ArrayKlass unexpected here");
159 // Populate default values...
160 objArrayHandle array_h(THREAD, array);
161 instanceOop value = (instanceOop) ValueKlass::cast(element_klass())->default_value();
162 for (int i = 0; i < length; i++) {
163 array_h->obj_at_put(i, value);
164 }
165 }
166 return array;
167 }
168
169 static int multi_alloc_counter = 0;
170
171 oop ObjArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
172 int length = *sizes;
173 if (rank == 1) { // last dim may be valueArray, check if we have any special storage requirements
174 if ((!element_klass()->is_array_klass()) && storage_properties().is_null_free()) {
175 return oopFactory::new_valueArray(element_klass(), length, CHECK_NULL);
176 } else {
177 return oopFactory::new_objArray(element_klass(), length, CHECK_NULL);
178 }
179 }
180 guarantee(rank > 1, "Rank below 1");
181 // Call to lower_dimension uses this pointer, so most be called before a
182 // possible GC
183 Klass* ld_klass = lower_dimension();
184 // If length < 0 allocate will throw an exception.
185 objArrayOop array = allocate(length, CHECK_NULL);
186 objArrayHandle h_array (THREAD, array);
187 if (length != 0) {
188 for (int index = 0; index < length; index++) {
189 ArrayKlass* ak = ArrayKlass::cast(ld_klass);
190 oop sub_array = ak->multi_allocate(rank-1, &sizes[1], CHECK_NULL);
191 h_array->obj_at_put(index, sub_array);
192 }
193 } else {
194 // Since this array dimension has zero length, nothing will be
195 // allocated, however the lower dimension values must be checked
196 // for illegal values.
197 for (int i = 0; i < rank - 1; ++i) {
198 sizes += 1;
199 if (*sizes < 0) {
200 THROW_MSG_0(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", *sizes));
201 }
202 }
203 }
204 return h_array();
205 }
206
207 ArrayStorageProperties ObjArrayKlass::storage_properties() {
208 return name()->is_Q_array_signature() ? ArrayStorageProperties::null_free : ArrayStorageProperties::empty;
209 }
210
211 // Either oop or narrowOop depending on UseCompressedOops.
212 void ObjArrayKlass::do_copy(arrayOop s, size_t src_offset,
213 arrayOop d, size_t dst_offset, int length, TRAPS) {
214 if (oopDesc::equals(s, d)) {
215 // since source and destination are equal we do not need conversion checks.
216 assert(length > 0, "sanity check");
217 ArrayAccess<>::oop_arraycopy(s, src_offset, d, dst_offset, length);
218 } else {
219 // We have to make sure all elements conform to the destination array
220 Klass* bound = ObjArrayKlass::cast(d->klass())->element_klass();
221 Klass* stype = ObjArrayKlass::cast(s->klass())->element_klass();
222 if (stype == bound || stype->is_subtype_of(bound)) {
223 // elements are guaranteed to be subtypes, so no check necessary
224 ArrayAccess<ARRAYCOPY_DISJOINT>::oop_arraycopy(s, src_offset, d, dst_offset, length);
225 } else {
226 // slow case: need individual subtype checks
227 // note: don't use obj_at_put below because it includes a redundant store check
228 if (!ArrayAccess<ARRAYCOPY_DISJOINT | ARRAYCOPY_CHECKCAST>::oop_arraycopy(s, src_offset, d, dst_offset, length)) {
229 ResourceMark rm(THREAD);
230 stringStream ss;
328 } else if (UseCompressedOops) {
329 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(src_pos);
330 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<narrowOop>(dst_pos);
331 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(s, src_offset, NULL) ==
332 objArrayOop(s)->obj_at_addr_raw<narrowOop>(src_pos), "sanity");
333 assert(arrayOopDesc::obj_offset_to_raw<narrowOop>(d, dst_offset, NULL) ==
334 objArrayOop(d)->obj_at_addr_raw<narrowOop>(dst_pos), "sanity");
335 do_copy(s, src_offset, d, dst_offset, length, CHECK);
336 } else {
337 size_t src_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(src_pos);
338 size_t dst_offset = (size_t) objArrayOopDesc::obj_at_offset<oop>(dst_pos);
339 assert(arrayOopDesc::obj_offset_to_raw<oop>(s, src_offset, NULL) ==
340 objArrayOop(s)->obj_at_addr_raw<oop>(src_pos), "sanity");
341 assert(arrayOopDesc::obj_offset_to_raw<oop>(d, dst_offset, NULL) ==
342 objArrayOop(d)->obj_at_addr_raw<oop>(dst_pos), "sanity");
343 do_copy(s, src_offset, d, dst_offset, length, CHECK);
344 }
345 }
346
347
348 Klass* ObjArrayKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, int n, TRAPS) {
349 assert(!storage_props.is_flattened() || n > 1, "Cannot flatten");
350 assert(dimension() <= n, "check order of chain");
351 int dim = dimension();
352 if (dim == n) return this;
353
354 // lock-free read needs acquire semantics
355 if (higher_dimension_acquire() == NULL) {
356 if (or_null) return NULL;
357
358 ResourceMark rm;
359 JavaThread *jt = (JavaThread *)THREAD;
360 {
361 // Ensure atomic creation of higher dimensions
362 MutexLocker mu(MultiArray_lock, THREAD);
363
364 // Check if another thread beat us
365 if (higher_dimension() == NULL) {
366
367 // Create multi-dim klass object and link them together
368 Klass* k =
369 ObjArrayKlass::allocate_objArray_klass(storage_props, dim + 1, this, CHECK_NULL);
370 ObjArrayKlass* ak = ObjArrayKlass::cast(k);
371 ak->set_lower_dimension(this);
372 // use 'release' to pair with lock-free load
373 release_set_higher_dimension(ak);
374 assert(ak->is_objArray_klass(), "incorrect initialization of ObjArrayKlass");
375 }
376 }
377 } else {
378 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
379 }
380
381 ObjArrayKlass *ak = ObjArrayKlass::cast(higher_dimension());
382 if (or_null) {
383 return ak->array_klass_or_null(storage_props, n);
384 }
385 return ak->array_klass(storage_props, n, THREAD);
386 }
387
388 Klass* ObjArrayKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, TRAPS) {
389 return array_klass_impl(storage_props, or_null, dimension() + 1, THREAD);
390 }
391
392 bool ObjArrayKlass::can_be_primary_super_slow() const {
393 if (!bottom_klass()->can_be_primary_super())
394 // array of interfaces
395 return false;
396 else
397 return Klass::can_be_primary_super_slow();
398 }
399
400 GrowableArray<Klass*>* ObjArrayKlass::compute_secondary_supers(int num_extra_slots,
401 Array<InstanceKlass*>* transitive_interfaces) {
402 assert(transitive_interfaces == NULL, "sanity");
403 // interfaces = { cloneable_klass, serializable_klass, elemSuper[], ... };
404 const Array<Klass*>* elem_supers = element_klass()->secondary_supers();
405 int num_elem_supers = elem_supers == NULL ? 0 : elem_supers->length();
406 int num_secondaries = num_extra_slots + 2 + num_elem_supers;
407 if (num_secondaries == 2) {
408 // Must share this for correct bootstrapping!
409 set_secondary_supers(Universe::the_array_interfaces_array());
410 return NULL;
411 } else {
412 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(num_elem_supers+2);
413 secondaries->push(SystemDictionary::Cloneable_klass());
414 secondaries->push(SystemDictionary::Serializable_klass());
415 for (int i = 0; i < num_elem_supers; i++) {
416 Klass* elem_super = elem_supers->at(i);
417 Klass* array_super = elem_super->array_klass_or_null(ArrayStorageProperties::empty);
418 assert(array_super != NULL, "must already have been created");
419 secondaries->push(array_super);
420 }
421 return secondaries;
422 }
423 }
424
425 void ObjArrayKlass::initialize(TRAPS) {
426 bottom_klass()->initialize(THREAD); // dispatches to either InstanceKlass or TypeArrayKlass
427 }
428
429 void ObjArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
430 ArrayKlass::metaspace_pointers_do(it);
431 it->push(&_element_klass);
432 it->push(&_bottom_klass);
433 }
434
435 // JVM support
436
437 jint ObjArrayKlass::compute_modifier_flags(TRAPS) const {
|